Grokking Google Coding Interview
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Who Should Take This Course?
Google Easy
Add Binary (easy)
Solution: Add Binary
Valid Mountain Array (easy)
Solution: Valid Mountain Array
Set Mismatch (easy)
Solution: Set Mismatch
Is Subsequence (easy)
Solution: Is Subsequence
Length of Last Word (easy)
Solution: Length of Last Word
Search Insert Position (easy)
Solution: Search Insert Position
Repeated Substring Pattern (easy)
Solution: Repeated Substring Pattern
Monotonic Array (easy)
Solution: Monotonic Array
Count Nodes Equal to Average of Subtree (easy)
Solution: Count Nodes Equal to Average of Subtree
Find the Difference (easy)
Solution: Find the Difference
How Many Numbers Are Smaller Than the Current Number (easy)
Solution: How Many Numbers Are Smaller Than the Current Number
Binary Tree Paths (easy)
Solution: Binary Tree Paths
Find the Difference of Two Arrays (easy)
Solution: Find the Difference of Two Arrays
Merge Strings Alternately (easy)
Solution: Merge Strings Alternately
Reverse a LinkedList (easy)
Solution: Reverse a LinkedList
Google Medium
Gray Code (medium)
Solution: Gray Code
2 Keys Keyboard (medium)
Solution: 2 Keys Keyboard
Arithmetic Slices (medium)
Solution: Arithmetic Slices
Unique Length-3 Palindromic Subsequences (medium)
Solution: Unique Length-3 Palindromic Subsequences
Minimum Difference Between Largest and Smallest Value in Three Moves (medium)
Solution: Minimum Difference Between Largest and Smallest Value in Three Moves
Letter Combinations of a Phone Number (medium)
Solution: Letter Combinations of a Phone Number
01 Matrix (medium)
Solution: 01 Matrix
Maximum Points You Can Obtain from Cards (medium)
Solution: Maximum Points You Can Obtain from Cards
Strobogrammatic Number II (medium)
Solution: Strobogrammatic Number II
Maximum Length of Semi-Decreasing Subarrays (medium)
Solution: Maximum Length of Semi-Decreasing Subarrays
Minimum Area Rectangle (medium)
Solution: Minimum Area Rectangle
Count Unreachable Pairs of Nodes in an Undirected Graph (medium)
Solution: Count Unreachable Pairs of Nodes in an Undirected Graph
Single Number II (medium)
Solution: Single Number II
4Sum II (medium)
Solution: 4Sum II
Furthest Building You Can Reach (medium)
Solution: Furthest Building You Can Reach
Minimizing Array After Replacing Pairs With Their Product (medium)
Solution: Minimizing Array After Replacing Pairs With Their Product
Fair Distribution of Cookies (medium)
Solution: Fair Distribution of Cookies
Find Leaves of Binary Tree (medium)
Solution: Find Leaves of Binary Tree
Rotate Image (medium)
Solution: Rotate Image
Combination Sum (medium)
Solution: Combination Sum
Implement Trie (Prefix Tree) (medium)
Solution: Implement Trie (Prefix Tree)
Number of Islands (medium)
Solution: Number of Islands
Edit Distance (medium)
Solution: Edit Distance
Container With Most Water (Medium)
Solution: Container With Most Water
Meeting Rooms II (medium)
Solution: Meeting Rooms II
Shortest Subarray with Sum at Least K (hard)
Solution: Shortest Subarray with Sum at Least K
Reverse Pairs (hard)
Solution: Reverse Pairs
Nth Magical Number (hard)
Solution: Nth Magical Number
Candy (hard)
Solution: Candy
Arithmetic Slices II - Subsequence (hard)
Solution: Arithmetic Slices II - Subsequence
Burst Balloons (hard)
Solution: Burst Balloons
Sum of Distances in Tree (hard)
Solution: Sum of Distances in Tree
Maximum Score of a Good Subarray (hard)
Solution: Maximum Score of a Good Subarray
Trapping Rain Water (hard)
Solution: Trapping Rain Water
First Missing Positive (hard)
Solution: First Missing Positive
Solution: Furthest Building You Can Reach

Problem Statement

You are given an array of integers heights, where heights[i] is the height of the ith building, integer bricks, and integer ladders.

You start traveling from the first building and move to the next building by either using bricks or ladders.

Each time you encounter a building taller than the one you're currently on, you have two options:

  • climb up using a fixed amount of bricks for each unit of height difference
  • Or, utilize a ladder to bypass the height difference entirely

Return the index (0-indexed) of the furthest building you can reach if you use the given ladders and bricks optimally.

Examples

Example 1:

  • Input: heights = [4,12,2,7,3,18,20,3,19], bricks = 10, ladders = 2
  • Expected Output: 7
  • Justification:
    • Move from building 0 to 1 using a ladder.
    • Move from building 1 to 2 without using any resources.
    • Move from building 2 to 3 using 5 bricks.
    • Move from building 3 to 4 without using any resources.
    • Move from building 4 to 5 using a ladder.
    • Move from building 5 to 6 using 2 bricks.
    • Move from building 3 to 4 without using any resources.

Example 2:

  • Input: heights = [1,5,1,2,3,4,10000], bricks = 4, ladders = 1
  • Expected Output: 5
  • Justification: Use the ladder for the large jump from 0 to 1. Use bricks for smaller climbs from 1 to 2, 2 to 3, 3 to 4, and 4 to 5. This strategy gets you to the 5th building before running out of resources.

Example 3:

  • Input: heights = [5,1,1,1,1,1,1,1,1,1,20], bricks = 10, ladders = 1
  • Expected Output: 10
  • Justification: Use the ladder for the last large climb from 9 to 10 buildings. Bricks can be used for one of the single-unit climbs if necessary, allowing you to reach the last building.

Solution

To solve this problem, we will adopt a greedy strategy that prioritizes the use of ladders for the largest height differences between buildings, ensuring bricks are conserved for smaller gaps. This approach works because ladders can cover any height difference, making them more valuable for larger gaps, whereas bricks are finite and should be used sparingly. We'll manage this by keeping track of the height differences where ladders are used in a min-priority queue structure. When we run out of ladders, we will start replacing the smallest ladder-used gaps with bricks, ensuring we always make the optimal choice for ladder and brick usage.

Our method ensures that we can travel the maximum distance by optimally utilizing the resources at our disposal. It strikes a balance between the use of ladders for significant height differences and bricks for smaller ones. This way, we stretch the utility of our resources and ensure that we can cover as much ground as possible.

Step-by-Step Algorithm

  1. Initialize a priority queue (min heap) ladderAllocations to keep track of the heights differences that have been climbed using ladders. Also, prepare a variable usedBricks to count the number of bricks used.
  2. Iterate through the array of building heights.
    • For each pair of adjacent buildings, calculate the height difference diff (if the next building is taller).
    • If diff > 0, attempt to use a ladder by adding diff to ladderAllocations.
    • If the size of ladderAllocations exceeds the number of ladders available, remove the smallest height difference from the priority queue and subtract that value from bricks.
    • If bricks value is less than 0 at any point, return the current index as the furthest building you can reach.
  3. If you can iterate through all buildings without exceeding the available bricks, return the last building's index as the furthest you can reach.

Algorithm Walkthrough

Let's consider the Input: heights = [4,12,2,7,3,18,20,3,19], bricks = 10, and ladders = 2.

  • Start with an empty priority queue and 0 used bricks.
  • Move from building 0 to 1 (heights[0] to heights[1]):
    • Height difference is 12 - 4 = 8. Since it's positive, we consider using resources.
    • Add 8 to the priority queue. Priority queue now contains [8].
    • No need to use bricks since the number of ladders exceeds the queue's size.
  • Move from building 1 to 2 (heights[1] to heights[2]):
    • Height difference is 2 - 12 = -10. No resources are needed as the next building is shorter.
  • Move from building 2 to 3 (heights[2] to heights[3]):
    • Height difference is 7 - 2 = 5. Since it's positive, we consider using resources.
    • Add 5 to the priority queue. Priority queue now contains [5, 8].
    • No need to use bricks since the number of ladders exceeds the queue's size.
  • Move from building 3 to 4 (heights[3] to heights[4]):
    • Height difference is 3 - 7 = -4. No resources are needed as the next building is shorter.
  • Move from building 4 to 5 (heights[4] to heights[5]):
    • Height difference is 18 - 3 = 15. Since it's positive, we consider using resources.
    • Add 15 to the priority queue. Priority queue now contains [5, 8, 15].
    • Since the queue's size now exceeds the number of ladders, remove the smallest element (5) and subtract from bricks. bricks becomes 5. Priority queue now contains [8, 15].
  • Move from building 5 to 6 (heights[5] to heights[6]):
    • Height difference is 20 - 18 = 2. Since it's positive, we consider using resources.
    • Add 2 to the priority queue. Priority queue now contains [2, 8, 15].
    • Since the queue's size exceeds the number of ladders, remove the smallest element (2) and subtract from bricks``. bricksbecomes3. Priority queue now contains [8, 15]`.
  • Move from building 6 to 7 (heights[6] to heights[7]):
    • Height difference is 3 - 20 = -17. No resources are needed as the next building is shorter.
  • Move from building 7 to 8 (heights[7] to heights[8]):
    • Height difference is 19 - 3 = 16. Since it's positive, we consider using resources.
    • Add 16 to the priority queue. Priority queue now contains [8, 15, 16].
    • Since the queue's size exceeds the number of ladders, remove the smallest element (8) and subtract from bricks. bricks becomes -5, which is less than 0. So, return the current index 7.
  • Final Result: You can reach to the 7th (0-based) building using the given resources.
Java
Saved to Cloud

. . . .

Complexity Analysis

Time Complexity

  • Insertion into the Min-Heap: Each insertion operation into the min-heap takes time, where (m) is the number of elements in the heap.
  • Iterating through the buildings: The solution iterates through the buildings once, leading to operations where (n) is the number of buildings.
  • Heap operations: In the worst case, each building difference could be pushed into and popped from the heap once, leading to for heap operations since the heap size can grow up to (n - 1).

Overall, the time complexity of the solution is , where (n) is the number of buildings.

Space Complexity

  • Heap Storage: The min-heap can store up to differences in height between buildings, leading to a space complexity of .
  • Auxiliary Space: Constant space is used for variables, leading to .

Thus, the space complexity of the solution is , where (n) is the number of buildings.

Furthest Building You Can Reach (medium)
Minimizing Array After Replacing Pairs With Their Product (medium)
Mark as Completed

On this page

Problem Statement

Examples

Solution

Step-by-Step Algorithm

Algorithm Walkthrough

Complexity Analysis

Time Complexity

Space Complexity